All Questions
Tagged with computational-physicsalgorithms
66 questions
4votes
1answer
199views
References for Numerical Solutions of the Feynman Path Integral
I am looking for references that discuss numerical approaches to evaluating the Feynman path integral. Specifically, I would like references (books, papers, or reviews) that cover: Discretization ...
0votes
0answers
34views
How to define an equitable success event in quantum-walk-based multiple-targets search algorithm?
In quantum search algorithms (on a 2D grid or other setting), when there are multiple targets, a "successful search" event is often defined in following: $$P_{success}=\max_{t\in [0,T]} \...
1vote
1answer
489views
Doubt in Verlet's Algorithm
In studying the temporal evolution of a system according to the deterministic model, we begin by considering a Taylor series expansion for the displacement $r$. First, we consider a positive variation ...
- 123
2votes
2answers
227views
Neglected Term in the energy gradient for Variational Monte-Carlo
I'm looking into variational Monte-Carlo to determine the optimal variational parameter that corresponds to the ground state of a Hamiltonian. In general I am interested in tight binding models where ...
- 463
2votes
0answers
84views
Multilateration of a light source in a medium whose index of refraction varies with position
Background I have a set of $N$ receivers whose locations in $3D$ space are well-known. These receivers are immersed in a medium whose index of refraction (and thereby the velocity of light propagation)...
- 217
0votes
0answers
38views
Force-simulation for graph layout: How to avoid particle collapsing into a single point?
In a force-based graph-layout simulation using Barnes-Hut, what are the conditions for collapse? With collapse I mean multiple (or even all) nodes "collapsing" into a single point. Is there ...
- 1
1vote
0answers
32views
Any quantum Monte-Carlo algorithm for calculating the lowest eigenenergy in each symmetry sector?
Suppose we have a hamiltonian which has the parity symmetry (e.g., the Heisenberg model with the open boundary condition). Is there any quantum Monte-Carlo algorithm which can be used to calculate the ...
- 2,175
2votes
0answers
86views
Is there a proof for critical slow-down in Monte Carlo?
It is physically understood why the standard Metropolis-Hasting algorithm slows down near the critical temperature, since it doesn’t utilize the divergence of the correlation length. However, I’m ...
- 2,263
0votes
0answers
46views
Is Quantum State Tomography (QST) an inherently supervised or unsupervised problem in Machine Learning?
I am studying how to apply neural networks to the problem of Quantum State Tomography (QST) and I got confused when it comes to decide if this is a supervised or unsupervised learning problem. At ...
- 161
0votes
0answers
53views
Understanding chapter 3.1 (Laplace's equation) in Introduction to electrodynamics Griffiths 4 ed [duplicate]
I really need help to understand chapter 3.1. What is the method of relaxation? How can I use the method of relaxation to solve Laplace's equation? How can I use the first and second uniqueness ...
- 9
1vote
0answers
95views
Simplest quantum Monte-Carlo method for the Bose-Hubbard model
I want to use quantum Monte-Carlo results to benchmark an algorithm for the Bose-Hubbard model. There are so many QMC methods in the market, so which one is the simplest one? I want the ground state ...
- 2,175
0votes
0answers
80views
How are the boundary conditions given in the SIMPLE algorithm on a forward staggered grid for a lid driven cavity flow?
I have a code given by my professor in which he applies the boundary conditions for the lid driven cavity flow. All the enforcement of boundary conditions I have seen elsewhere completely differ from ...
2votes
1answer
142views
Numerically computing induced magnetic field from current density
Let's say we have current density $J_i$ on a discretized grid with $(N_x \times N_y \times N_z)$ points. What is the best procedure to compute the induced magnetic field $(B_i)$ from the current ...
- 23
0votes
0answers
167views
What are the advantages of tensor network algorithms over monte-carlo simulations in terms of time-evolution?
I understand that tensor networks and monte carlo simulations are based on completely different principles. However, to my knowledge both are used to simulate the time evolution of a system. Is there ...
- 343
1vote
1answer
48views
An example problem to solve using 100 qubits?
Suppose we have in our possession 100 pairs of electrons. Each electron A1 - A100 is entangled with its respective twin B1 - B100. Each entangled electron pair has been set up to have opposite spins (...
- 627
